Functional Decomposition Using Principal Subfields
نویسندگان
چکیده
Let f ∈ K(t) be a univariate rational function. It is well known that any non-trivial decomposition g ◦ h, with g, h ∈ K(t), corresponds to a non-trivial subfield K(f(t)) ( L ( K(t) and vice-versa. In this paper we use the idea of principal subfields and fast subfield-intersection techniques to compute the subfield lattice of K(t)/K(f(t)). This yields a Las Vegas algorithm with improved complexity and better run times for finding all non-equivalent complete decompositions of f . CCS Concepts •Computing methodologies → Algebraic algorithms;
منابع مشابه
On Polynomial Decompositions
The purpose of this paper is to introduce the norm decomposition which enables us to compute the roots of a monic irreducible imprimitive polynomial f ∈ Q[t] by solving polynomial equations of lower degree. We call an irreducible polynomial f imprimitive if the number field generated by a root of f contains non-trivial subfields. We will see that for each subfield there exists a norm decomposit...
متن کامل. N T ] 2 3 Ju l 2 01 7 ON SUBFIELDS OF THE HERMITIAN FUNCTION FIELDS INVOLVING THE INVOLUTION AUTOMORPHISM
A function field over a finite field is called maximal if it achieves the Hasse-Weil bound. Finding possible genera that maximal function fields achieve has both theoretical interest and practical applications to coding theory and other topics. As a subfield of a maximal function field is also maximal, one way to find maximal function fields is to find all subfields of a maximal function field....
متن کاملPersian Handwriting Analysis Using Functional Principal Components
Principal components analysis is a well-known statistical method in dealing with large dependent data sets. It is also used in functional data for both purposes of data reduction as well as variation representation. On the other hand "handwriting" is one of the objects, studied in various statistical fields like pattern recognition and shape analysis. Considering time as the argument,...
متن کاملThe Complexity of Computing all Subfields of an Algebraic Number Field
For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields ofK/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then this leads to faster run times and an improved complexity.
متن کاملFunctional Singular Component Analysis
Aiming at quantifying the dependency of pairs of functional data (X,Y ), we develop the concept of functional singular value decomposition for covariance and functional singular component analysis, building on the concept of “canonical expansion” of compact operators in functional analysis. We demonstrate the estimation of the resulting singular values, functions and components for the practica...
متن کامل